Linear transformations that preserve the permanent

On certain semigroups of transformations that preserve double direction equivalence

Let TX be the full transformation semigroups on the set X. For an equivalence E on X, let TE(X) = {α ∈ TX : ∀(x, y) ∈ E ⇔ (xα, yα) ∈ E}It is known that TE(X) is a subsemigroup of TX. In this paper, we discussthe Green's *-relations, certain *-ideal and certain Rees quotient semigroup for TE(X).

Transformations that Preserve Learnability

on certain semigroups of transformations that preserve double direction equivalence

let tx be the full transformation semigroups on the set x. for an equivalence e on x, let te(x) = {α ∈ tx : ∀(x, y) ∈ e ⇔ (xα, yα) ∈ e}it is known that te(x) is a subsemigroup of tx. in this paper, we discussthe green's *-relations, certain *-ideal and certain rees quotient semigroup for te(x).

Do Linear Transformations Preserve Fuzzy Linear Independence? Some Examples

In this paper, we examine whether basic linear transformations in R 2, such as rotations, scales, etc, preserve fuzzy linear independence. We provide some examples to the contrary. Mathematics Subject Classification: 08A72, 03E72

On Transformations of Interactive Proofs that Preserve the Prover's Complexity

Goldwasser and Sipser [GS89] proved that every interactive proof system can be transformed into a public-coin one (a.k.a., an Arthur–Merlin game). Their transformation has the drawback that the computational complexity of the prover’s strategy is not preserved. We show that this is inherent, by proving that the same must be true of any transformation which only uses the original prover and veri...